Generalized Gorshkov-Wirsing Polynomials and the Integer Chebyshev Problem
نویسنده
چکیده
Interval LLL SIMPLEX HS Amoroso Lower # CP [-1, 1] 1/1.5314 1/1.5334 1/1.4772 1/1.4520 1/1.5417 8 [-1/2, 1/2] 1/2.3559 1/2.3619 1/2.1822 1/1.4520 1/2.3768 9 [-1/3, 1/3] 1/3.2522 1/3.2617 1/3.0000 1/1.3887 1/3.2842 7 [-2/3, 2/3] 1/1.8820 1/1.8883 1/1.7237 1/1.3887 1/1.9845 5 [-1/4, 1/4] 1/4.1921 1/4.2025 1/4.0000 1/1.1097 1/4.2260 6 [-3/4, 3/4] 1/1.7897 1/1.7935 1/1.7237 1/1.1097 1/1.9653 3 [-1/5, 1/5] 1/5.1554 1/5.1664 1/5.0000 1/.92171 1/5.1867 6 [-2/5, 2/5] 1/2.7715 1/2.7781 1/2.5100 1/.92171 1/3.0680 3 [-3/5, 3/5] 1/2.0667 1/2.0740 1/1.9466 1/.92171 1/2.2562 5 [-4/5, 4/5] 1/1.6959 1/1.7011 1/1.5431 1/.92171 1/1.8512 3
منابع مشابه
A numerical Algorithm Based on Chebyshev Polynomials for Solving some Inverse Source Problems
In this paper, two inverse problems of determining an unknown source term in a parabolic equation are considered. First, the unknown source term is estimated in the form of a combination of Chebyshev functions. Then, a numerical algorithm based on Chebyshev polynomials is presented for obtaining the solution of the problem. For solving the problem, the operational matrices of int...
متن کاملThe Multivariate Integer Chebyshev Problem
The multivariate integer Chebyshev problem is to find polynomials with integer coefficients that minimize the supremum norm over a compact set in C. We study this problem on general sets, but devote special attention to product sets such as cube and polydisk. We also establish a multivariate analog of the Hilbert-Fekete upper bound for the integer Chebyshev constant, which depends on the dimens...
متن کاملA spectral method based on the second kind Chebyshev polynomials for solving a class of fractional optimal control problems
In this paper, we consider the second-kind Chebyshev polynomials (SKCPs) for the numerical solution of the fractional optimal control problems (FOCPs). Firstly, an introduction of the fractional calculus and properties of the shifted SKCPs are given and then operational matrix of fractional integration is introduced. Next, these properties are used together with the Legendre-Gauss quadrature fo...
متن کاملSmall Polynomials with Integer Coefficients
The primary goal of this paper is the study of polynomials with integer coefficients that minimize the sup norm on the set E. In particular, we consider the asymptotic behavior of these polynomials and of their zeros. Let Pn(C) and Pn(Z) be the classes of algebraic polynomials of degree at most n, respectively with complex and with integer coefficients. The problem of minimizing the uniform nor...
متن کاملPolynomials with integer coefficients and their zeros
We study several related problems on polynomials with integer coefficients. This includes the integer Chebyshev problem, and the Schur problems on means of algebraic numbers. We also discuss interesting applications to the approximation by polynomials with integer coefficients, and to the growth of coefficients for polynomials with roots located in prescribed sets. The distribution of zeros for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Experimental Mathematics
دوره 20 شماره
صفحات -
تاریخ انتشار 2011